Heuristics for Packing Semifluids

نویسنده

  • João Pedro Pedroso
چکیده

Physical properties of materials are seldom studied in the context of packing problems. In this work we study the behavior of semifluids: materials with particular characteristics, that share properties both with solids and with fluids. We describe the importance of some specific semifluids in an industrial context, and propose methods for tackling the problem of packing them, taking into account several practical requirements and physical constraints. Although the focus of this paper is on the computation of practical solutions, it also uncovers interesting mathematical properties of this problem, which differentiate it from other packing problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A genetic programming hyper-heuristic approach to automated packing

This thesis presents a programme of research which investigated a genetic programming hyper-heuristic methodology to automate the heuristic design process for one, two and three dimensional packing problems. Traditionally, heuristic search methodologies operate on a space of potential solutions to a problem. In contrast, a hyper-heuristic is a heuristic which searches a space of heuristics, rat...

متن کامل

New Worst-case Results for the Bin-Packing Problem

In this note we consider the familiar bin-packing problem and provide new worst-case results for a number of classical heuristics. We show that the first-fit and best-fit heuristics have an absolute performance ratio of no more than 1.75, and first-fit decreasing and best-fit decreasing heuristics have an absolute performance ratio of 1.5. The latter is the best possible absolute performance ra...

متن کامل

An Empirical Study of Three Packing Heuristics for Bins with Adjustable Capacity – an Application to Operating Room Scheduling

Using simulation, we compare three offline packing heuristics for adjustable-size bins, a problem derived from operating room scheduling, on 500 days of generated data using different cost structures. Unlike classical bin-packing studies, we found that next-fit-decreasing is the best performing method. Subject Areas: Simulation, Bin Packing, OR and Scheduling.

متن کامل

Scalability of Evolved On Line Bin Packing Heuristics

The on line bin packing problem concerns the packing of pieces into the least number of bins possible, as the pieces arrive in a sequential fashion. In previous work we used genetic programming to evolve heuristics for this problem, which beat the human designed best fit algorithm. Here we examine the performance of the evolved heuristics on larger instances of the problem, which contain many m...

متن کامل

The Scalability of Evolved On Line Bin Packing Heuristics

The on line bin packing problem concerns the packing of pieces into the least number of bins possible, as the pieces arrive in a sequential fashion. In previous work, we used genetic programming to evolve heuristics for this problem, which beat the human designed ‘best fit’ algorithm. Here we examine the performance of the evolved heuristics on larger instances of the problem, which contain man...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1607.04403  شماره 

صفحات  -

تاریخ انتشار 2016